Laplacian integrality in P4-sparse and P4-extendible graphs
نویسندگان
چکیده
Let G be a simple graph and L = L(G) the Laplacian matrix of G. G is called L-integral if all its Laplacian eigenvalues are integer numbers. It is known that every cograph, a graph free of P4, is L-integral. The class of P4-sparse graphs and the class of P4-extendible graphs contain the cographs. It seems natural to investigate if the graphs in these classes are still L-integral. In this paper we characterized the L-integral graphs for both cases, P4-sparse graphs and P4-extendible graphs.
منابع مشابه
On P4-tidy graphs
We study the P4-tidy graphs, a new class defined by Rusu [30] in order to illustrate the notion of P4-domination in perfect graphs. This class strictly contains the P4-extendible graphs and the P4-lite graphs defined by Jamison & Olariu in [19] and [23] and we show that the P4-tidy graphs and P4-lite graphs are closely related. Note that the class of P4-lite graphs is a class of brittle graphs ...
متن کاملGrundy number on P4-classes
In this article, we define a new class of graphs, the fat-extended P4-laden graphs, and we show a polynomial time algorithm to determine the Grundy number of the graphs in this class. This result implies that the Grundy number can be found in polynomial time for any graph of the following classes: P4-reducible, extended P4-reducible, P4-sparse, extended P4-sparse, P4-extendible, P4-lite, P4-tid...
متن کاملOn Some Cograph Extensions and Their Algorithms
This paper reviews some classes of graphs related to cographs. The characterization of cographs by which there is no induced path on three edges (P4) is relaxed in various ways. Considered are classes of graphs that are uniquely representable by trees. Three such classes studied here are: P4-reducible, P4-sparse and P4-extendible graphs. In addition, we show that the class of P4-lite graphs has...
متن کاملOn variations of P4-sparse graphs
Hoàng defined the P4-sparse graphs as the graphs where every set of five vertices induces at most one P4. These graphs attracted considerable attention in connection with the P4-structure of graphs and the fact that P4-sparse graphs have bounded clique-width. Fouquet and Giakoumakis generalized this class to the nicely structured semi-P4-sparse graphs being the (P5, co-P5, co-chair)-free graphs...
متن کاملThe Graph Sandwich Problem for P4-sparse graphs
The P4-sparse Graph Sandwich Problem asks, given two graphs G 1 = (V, E1) and G2 = (V, E2), whether there exists a graph G = (V, E) such that E1 ⊆ E ⊆ E2 and G is P4-sparse. In this paper we present a polynomial-time algorithm for solving the Graph Sandwich Problem for P4-sparse graphs. c © 2008 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Applied Mathematics and Computation
دوره 330 شماره
صفحات -
تاریخ انتشار 2018